Facet browsing currently unavailable
Page 10 of 1735 results
Sort by: relevance publication year
On stabbling lines for convex polyhedra in 3D JOURNAL ARTICLE published August 1994 in Computational Geometry |
Progressive transmission of subdivision surfaces JOURNAL ARTICLE published February 2000 in Computational Geometry |
Sparse convex hull coverage JOURNAL ARTICLE published October 2021 in Computational Geometry Research funded by National Science Foundation Division of Computing and Communication Foundations (1750780) |
Wrapping spheres with flat paper JOURNAL ARTICLE published October 2009 in Computational Geometry |
Computing the Fréchet distance between uncertain curves in one dimension JOURNAL ARTICLE published February 2023 in Computational Geometry Research funded by Nederlandse Organisatie voor Wetenschappelijk Onderzoek (612.001.651,612.001.801,614.001.504) |
Maximum number of almost similar triangles in the plane JOURNAL ARTICLE published August 2022 in Computational Geometry |
On the geometric dilation of closed curves, graphs, and point sets JOURNAL ARTICLE published January 2007 in Computational Geometry |
Sparse geometric graphs with small dilation JOURNAL ARTICLE published August 2008 in Computational Geometry |
An exact and efficient approach for computing a cell in an arrangement of quadrics JOURNAL ARTICLE published January 2006 in Computational Geometry |
An improved algorithm for Kleeʼs measure problem on fat boxes JOURNAL ARTICLE published July 2012 in Computational Geometry |
Unfolding Manhattan Towers JOURNAL ARTICLE published July 2008 in Computational Geometry |
The structure of optimal partitions of orthogonal polygons into fat rectangles JOURNAL ARTICLE published May 2004 in Computational Geometry |
Time–space trade-offs for triangulations and Voronoi diagrams JOURNAL ARTICLE published August 2018 in Computational Geometry Research funded by MEXT (12H00855,15H02665) | DFG (MU 3501/1,MU 3501/2) | DFG (GRK 1408) |
Maximizing the overlap of two planar convex sets under rigid motions JOURNAL ARTICLE published May 2007 in Computational Geometry |
Triangulations in CGAL JOURNAL ARTICLE published May 2002 in Computational Geometry |
An algorithm for constructing star-shaped drawings of plane graphs JOURNAL ARTICLE published February 2010 in Computational Geometry |
Unit distances between vertices of a convex polygon JOURNAL ARTICLE published October 1992 in Computational Geometry |
Polygons cuttable by a circular saw JOURNAL ARTICLE published October 2001 in Computational Geometry |
On the chromatic number of some geometric type Kneser graphs JOURNAL ARTICLE published September 2005 in Computational Geometry |
Removing local extrema from imprecise terrains JOURNAL ARTICLE published August 2012 in Computational Geometry Research funded by German Ministry for Education and Research (BMBF) (03NAPI4 “ADVEST”) | U.S. Office of Naval Research (N00014-08-1-1015) | Netherlands Organisation for Scientific Research (NWO) (639.021.123) |